Signature S hemes Based on the Strong RSA Assumption

Signature S hemes Based on the Strong RSA Assumption

Short Signatures Without Random Oracles

We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes withou...

Signature Schemes Based on the Strong RSAAssumptionRonald

We describe and analyze a new digital signature scheme. The new scheme is quite eecient, does not require the the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called Strong RSA Assumption. Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the ...

Verifiable Signature Sharing Scheme Based on Strong RSA Assumption

In 2000, Cramer and Shoup presented a signature scheme which is secure against adaptive chosen-message attacks under the strong RSA assumption in the standard model. Then, in 2003, under the strong RSA assumption only, Fischlin produced a signature of roughly half the length. A verifiable signature sharing scheme (VΣS) introduced by Franklin and Reiter in 1995 enables the recipient of a signatu...

A Practical and Tightly Secure Signature Scheme Without Hash Function

In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the Cramer-Shoup (CS) signature scheme. Remarkably, these schemes meet the highest security notion in the standard model. They however differ in their implementation. The CS scheme and its subsequent variants and extensio...